Zentrum für Informationsdienste und Hochleistungsrechnen (ZIH) A primal-dual Jacobi–Davidson-like method for nonlinear eigenvalue problems
نویسندگان
چکیده
We propose a method for the solution of non-Hermitian ill-conditioned nonlinear eigenvalue problems T (λ)x = 0, which is based on singularity theory of nonlinear equations. The singularity of T (λ) is characterized by a scalar condition μ(λ) = 0 where the singularity function μ is implicitly defined by a nonsingular linear system with the appropriately bordered matrix T (λ). One Newton step for μ(λ) = 0 is performed which leads to a generalized Rayleigh quotient as new eigenvalue approximation, and the bordering vectors are updated, too. Quadratic convergence is shown. Rearranging of the system leads to equivalent Jacobi–Davidson-like correction equations. An important difference to standard JD is that the correction equations do not depend on the derivative of T and that only orthogonal projectors occur. Numerical examples demonstrate a considerably better performance of the new method compared to standard Jacobi–Davidson when applied to highly nonnormal eigenproblems.
منابع مشابه
A Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
The Jacobi-Davidson (JD) algorithm recently has gained popularity for finding a few selected interior eigenvalues of large sparse polynomial eigenvalue problems, which commonly appear in many computational science and engineering PDE based applications. As other inner–outer algorithms like Newton type method, the bottleneck of the JD algorithm is to solve approximately the inner correction equa...
متن کاملA parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc’s efficient and various parallel operations, linear so...
متن کاملProjection Methods for Nonlinear Sparse Eigenvalue Problems
This paper surveys numerical methods for general sparse nonlinear eigenvalue problems with special emphasis on iterative projection methods like Jacobi–Davidson, Arnoldi or rational Krylov methods and the automated multi–level substructuring. We do not review the rich literature on polynomial eigenproblems which take advantage of a linearization of the problem.
متن کاملA Jacobi-Davidson Method for Nonlinear Eigenproblems
For the nonlinear eigenvalue problem T (λ)x = 0 we consider a Jacobi–Davidson type iterative projection method. The resulting projected nonlinear eigenvalue problems are solved by inverse iteration. The method is applied to a rational eigenvalue problem governing damped vibrations of a structure.
متن کاملA Jacobi-Davidson-type projection method for nonlinear eigenvalue problems
This article discusses a projection method for nonlinear eigenvalue problems. The subspace of approximants is constructed by a Jacobi–Davidson type approach, and the arising eigenproblems of small dimension are solved by safeguarded iteration. The method is applied to a rational eigenvalue problem governing the vibrations of tube bundle immersed in an inviscid compressible fluid.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007